Sparse supernodal solver using block low-rank compression: Design, performance and analysis
نویسندگان
چکیده
منابع مشابه
Block Low-Rank (BLR) approximations to improve multifrontal sparse solvers
Matrices coming from elliptic Partial Differential Equations (PDEs) have been shown to have a lowrank property: well defined off-diagonal blocks of their Schur complements can be approximated by low-rank products. In the multifrontal context, this can be exploited within the fronts in order to obtain a substantial reduction of the memory requirement and an efficient way to perform many of the b...
متن کاملBlock-Diagonal Constrained Low-Rank and Sparse Graph for Discriminant Analysis of Image Data
Recently, low-rank and sparse model-based dimensionality reduction (DR) methods have aroused lots of interest. In this paper, we propose an effective supervised DR technique named block-diagonal constrained low-rank and sparse-based embedding (BLSE). BLSE has two steps, i.e., block-diagonal constrained low-rank and sparse representation (BLSR) and block-diagonal constrained low-rank and sparse ...
متن کاملSparse and Low Rank Recovery
Compressive sensing (sparse recovery) is a new area in mathematical image and signal processing that predicts that sparse signals can be recovered from what was previously believed to be highly incomplete measurement [3, 5, 7, 12]. Recently, the ideas of this field have been extended to the recovery of low rank matrices from undersampled information [6, 8]; most notably to the matrix completion...
متن کاملQuantitative Methods Inquires 179 IMPROVING THE PERFORMANCE OF SPARSE LU MATRIX FACTORIZATION USING A SUPERNODAL ALGORITHM
In this paper we investigate a method to improve the performance of sparse LU matrix factorization used to solve unsymmetric linear systems, which appear in many mathematical models. We introduced and used the concept of the supernode for unsymmetric matrices in order to use dense matrix operations to perform the LU factorization for sparse matrices. We describe an algorithm that uses supernode...
متن کاملAnalysis of VB Factorizations for Sparse and Low-Rank Estimation
Variational Bayesian (VB) factorial approximations anchor a wide variety of probabilistic models, where tractable posterior inference is almost never possible. This basic strategy is particularly attractive when estimating structured lowdimensional models of high-dimensional data, exemplified by the search for minimal rank and/or sparse approximations to observed data. To this end, VB models ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Science
سال: 2018
ISSN: 1877-7503
DOI: 10.1016/j.jocs.2018.06.007